Semi-dynamic breadth-first search in digraphs
نویسندگان
چکیده
منابع مشابه
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs
In this paper we study the problem of maintaining a single source shortest path tree or a breadth-rst search tree for a directed graph, in either an incremental or decremental setting. We maintain a single source shortest path tree of a directed graph G with unit edge weights during a sequence of edge deletions in total time O(mn), thus obtaining a O(n) amortized time for each deletion if the s...
متن کاملOn Dynamic Breadth-First Search in External-Memory
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monotone update sequences of either Θ(n) edge insertions or Θ(n) edge deletions, we prove an amortized high-probability bound of O(n/B + sort(n) · log B) I/Os per update. In contrast, the currently best approach for static...
متن کاملBreadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-c...
متن کاملExtended Breadth-First Search Algorithm
The task of artificial intelligence is to provide representation techniques for describing problems, as well as search algorithms that can be used to answer our questions. A widespread and elaborated model is state-space representation, which, however, has some shortcomings. Classical search algorithms are not applicable in practice when the state space contains even only a few tens of thousand...
متن کاملCombining depth-first and breadth-first search in Prolog execution
A new model for the execution of Prolog programs, called MEM (Multipath Execution Model), which combines a depth-first and breadth-first exploration of the search tree is presented. The breadth-first search allows more than one path (multiple potential solutions) to be explored at the same time. In this way, the computational cost of traversing the whole search tree associated to a program can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00132-2